TSTP Solution File: ANA097^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : ANA097^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 04:31:09 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of formulae : 43 ( 12 unt; 14 typ; 0 def)
% Number of atoms : 220 ( 57 equ; 0 cnn)
% Maximal formula atoms : 6 ( 7 avg)
% Number of connectives : 636 ( 29 ~; 15 |; 17 &; 564 @)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 82 ( 82 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 11 usr; 2 con; 0-5 aty)
% Number of variables : 74 ( 0 ^ 54 !; 12 ?; 74 :)
% ( 8 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_6,type,
'type/realax/real': $tType ).
thf(type_def_7,type,
sK0: $tType ).
thf(func_def_0,type,
'type/realax/real': $tType ).
thf(func_def_1,type,
'const/sets/UNION':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_2,type,
'const/sets/INTER':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_3,type,
'const/sets/FINITE':
!>[X0: $tType] : ( ( X0 > $o ) > $o ) ).
thf(func_def_4,type,
'const/realax/real_add': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(func_def_5,type,
'const/iterate/sum':
!>[X0: $tType] : ( ( X0 > $o ) > ( X0 > 'type/realax/real' ) > 'type/realax/real' ) ).
thf(func_def_6,type,
'const/iterate/monoidal':
!>[X0: $tType] : ( ( X0 > X0 > X0 ) > $o ) ).
thf(func_def_7,type,
'const/iterate/iterate':
!>[X0: $tType,X1: $tType] : ( ( X1 > X1 > X1 ) > ( X0 > $o ) > ( X0 > X1 ) > X1 ) ).
thf(func_def_11,type,
sK1: sK0 > $o ).
thf(func_def_12,type,
sK2: sK0 > $o ).
thf(func_def_13,type,
sK3: sK0 > 'type/realax/real' ).
thf(func_def_15,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f30,plain,
$false,
inference(subsumption_resolution,[],[f29,f24]) ).
thf(f24,plain,
( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f18,plain,
( ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true )
& ( ( 'const/sets/FINITE' @ sK0 @ sK1 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK1 @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK3 ) )
!= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f16,f17]) ).
thf(f17,plain,
( ? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
!= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) )
=> ( ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
= $true )
& ( ( 'const/sets/FINITE' @ sK0 @ sK1 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK1 @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK3 ) )
!= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f16,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true )
& ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
!= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) ),
inference(flattening,[],[f15]) ).
thf(f15,plain,
? [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
( ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
!= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) )
& ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) ),
inference(ennf_transformation,[],[f10]) ).
thf(f10,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
( ( ( ( 'const/sets/FINITE' @ X0 @ X2 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X1 )
= $true ) )
=> ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) ),
inference(fool_elimination,[],[f9]) ).
thf(f9,plain,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X1 ) )
=> ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) ),
inference(rectify,[],[f5]) ).
thf(f5,negated_conjecture,
~ ! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X1 ) )
=> ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) ),
inference(negated_conjecture,[],[f4]) ).
thf(f4,conjecture,
! [X0: $tType,X1: X0 > $o,X2: X0 > $o,X3: X0 > 'type/realax/real'] :
( ( ( 'const/sets/FINITE' @ X0 @ X2 )
& ( 'const/sets/FINITE' @ X0 @ X1 ) )
=> ( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ X1 @ X3 ) @ ( 'const/iterate/sum' @ X0 @ X2 @ X3 ) )
= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/UNION' @ X0 @ X1 @ X2 ) @ X3 ) @ ( 'const/iterate/sum' @ X0 @ ( 'const/sets/INTER' @ X0 @ X1 @ X2 ) @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nt03HUhV37/Vampire---4.8_349','thm/iterate/SUM_INCL_EXCL_') ).
thf(f29,plain,
( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true ),
inference(subsumption_resolution,[],[f28,f19]) ).
thf(f19,plain,
( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
= $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
= $true ),
inference(fool_elimination,[],[f11]) ).
thf(f11,plain,
'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
inference(rectify,[],[f2]) ).
thf(f2,axiom,
'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add',
file('/export/starexec/sandbox/tmp/tmp.Nt03HUhV37/Vampire---4.8_349','thm/iterate/MONOIDAL_REAL_ADD_') ).
thf(f28,plain,
( ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
!= $true )
| ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true ) ),
inference(subsumption_resolution,[],[f27,f23]) ).
thf(f23,plain,
( ( 'const/sets/FINITE' @ sK0 @ sK1 )
= $true ),
inference(cnf_transformation,[],[f18]) ).
thf(f27,plain,
( ( ( 'const/sets/FINITE' @ sK0 @ sK1 )
!= $true )
| ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
!= $true )
| ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true ) ),
inference(trivial_inequality_removal,[],[f26]) ).
thf(f26,plain,
( ( ( 'const/iterate/monoidal' @ 'type/realax/real' @ 'const/realax/real_add' )
!= $true )
| ( ( 'const/sets/FINITE' @ sK0 @ sK1 )
!= $true )
| ( ( 'const/sets/FINITE' @ sK0 @ sK2 )
!= $true )
| ( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK1 @ sK3 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK3 ) )
!= ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK1 @ sK3 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK3 ) ) ) ),
inference(superposition,[],[f25,f21]) ).
thf(f21,plain,
! [X1: $tType,X0: $tType,X2: X1 > X1 > X1,X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
( ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X3 )
!= $true )
| ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true ) ),
inference(cnf_transformation,[],[f14]) ).
thf(f14,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true )
| ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
( ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X3 )
!= $true ) ) ),
inference(flattening,[],[f13]) ).
thf(f13,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
( ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) )
| ( ( 'const/sets/FINITE' @ X0 @ X3 )
!= $true )
| ( ( 'const/sets/FINITE' @ X0 @ X4 )
!= $true ) )
| ( ( 'const/iterate/monoidal' @ X1 @ X2 )
!= $true ) ),
inference(ennf_transformation,[],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( ( 'const/iterate/monoidal' @ X1 @ X2 )
= $true )
=> ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
( ( ( ( 'const/sets/FINITE' @ X0 @ X3 )
= $true )
& ( ( 'const/sets/FINITE' @ X0 @ X4 )
= $true ) )
=> ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) ) ) ),
inference(fool_elimination,[],[f7]) ).
thf(f7,plain,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( 'const/iterate/monoidal' @ X1 @ X2 )
=> ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
( ( ( 'const/sets/FINITE' @ X0 @ X3 )
& ( 'const/sets/FINITE' @ X0 @ X4 ) )
=> ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) ) ) ),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: $tType,X2: X1 > X1 > X1] :
( ( 'const/iterate/monoidal' @ X1 @ X2 )
=> ! [X3: X0 > $o,X4: X0 > $o,X5: X0 > X1] :
( ( ( 'const/sets/FINITE' @ X0 @ X3 )
& ( 'const/sets/FINITE' @ X0 @ X4 ) )
=> ( ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X3 @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ X4 @ X5 ) )
= ( X2 @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/UNION' @ X0 @ X3 @ X4 ) @ X5 ) @ ( 'const/iterate/iterate' @ X0 @ X1 @ X2 @ ( 'const/sets/INTER' @ X0 @ X3 @ X4 ) @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nt03HUhV37/Vampire---4.8_349','thm/iterate/ITERATE_INCL_EXCL_') ).
thf(f25,plain,
( ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK1 @ sK3 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ sK2 @ sK3 ) )
!= ( 'const/realax/real_add' @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ sK3 ) @ ( 'const/iterate/iterate' @ sK0 @ 'type/realax/real' @ 'const/realax/real_add' @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ) ),
inference(definition_unfolding,[],[f22,f20,f20,f20,f20]) ).
thf(f20,plain,
! [X0: $tType] :
( 'const/iterate/sum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
inference(cnf_transformation,[],[f3]) ).
thf(f3,axiom,
! [X0: $tType] :
( 'const/iterate/sum'
@ ( X0
= ( 'const/iterate/iterate' @ X0 @ 'type/realax/real' @ 'const/realax/real_add' ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Nt03HUhV37/Vampire---4.8_349','thm/iterate/sum_') ).
thf(f22,plain,
( ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ sK1 @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ sK2 @ sK3 ) )
!= ( 'const/realax/real_add' @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/UNION' @ sK0 @ sK1 @ sK2 ) @ sK3 ) @ ( 'const/iterate/sum' @ sK0 @ ( 'const/sets/INTER' @ sK0 @ sK1 @ sK2 ) @ sK3 ) ) ),
inference(cnf_transformation,[],[f18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ANA097^1 : TPTP v8.1.2. Released v7.0.0.
% 0.12/0.15 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 15:30:08 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH1_THM_EQU_NAR problem
% 0.15/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.Nt03HUhV37/Vampire---4.8_349
% 0.15/0.37 % (631)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.37 % (631)Instruction limit reached!
% 0.15/0.37 % (631)------------------------------
% 0.15/0.37 % (631)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (631)Termination reason: Unknown
% 0.15/0.37 % (631)Termination phase: shuffling
% 0.15/0.37
% 0.15/0.37 % (631)Memory used [KB]: 895
% 0.15/0.37 % (631)Time elapsed: 0.002 s
% 0.15/0.37 % (631)Instructions burned: 2 (million)
% 0.15/0.37 % (631)------------------------------
% 0.15/0.37 % (631)------------------------------
% 0.15/0.37 % (628)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.15/0.37 % (627)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.15/0.37 % (629)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.15/0.37 % (630)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.15/0.37 % (632)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.15/0.37 % (633)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.15/0.37 % (630)Instruction limit reached!
% 0.15/0.37 % (630)------------------------------
% 0.15/0.37 % (630)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (630)Termination reason: Unknown
% 0.15/0.37 % (630)Termination phase: Saturation
% 0.15/0.37
% 0.15/0.37 % (630)Memory used [KB]: 895
% 0.15/0.37 % (630)Time elapsed: 0.004 s
% 0.15/0.37 % (630)Instructions burned: 3 (million)
% 0.15/0.37 % (630)------------------------------
% 0.15/0.37 % (630)------------------------------
% 0.15/0.37 % (628)Instruction limit reached!
% 0.15/0.37 % (628)------------------------------
% 0.15/0.37 % (628)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (628)Termination reason: Unknown
% 0.15/0.37 % (628)Termination phase: Saturation
% 0.15/0.37
% 0.15/0.37 % (628)Memory used [KB]: 5500
% 0.15/0.37 % (628)Time elapsed: 0.005 s
% 0.15/0.37 % (628)Instructions burned: 4 (million)
% 0.15/0.37 % (628)------------------------------
% 0.15/0.37 % (628)------------------------------
% 0.15/0.37 % (635)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on Vampire---4 for (2999ds/37Mi)
% 0.15/0.37 % Exception at run slice level
% 0.15/0.37 User error: Vampire does not support full TH1. This benchmark is either outside of the TH1 fragment, or outside of the fragment supported by Vampire
% 0.15/0.37 % (632)First to succeed.
% 0.15/0.38 % (634)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.15/0.38 % (632)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for Vampire---4
% 0.15/0.38 % SZS output start Proof for Vampire---4
% See solution above
% 0.15/0.38 % (632)------------------------------
% 0.15/0.38 % (632)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (632)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (632)Memory used [KB]: 5500
% 0.15/0.38 % (632)Time elapsed: 0.007 s
% 0.15/0.38 % (632)Instructions burned: 4 (million)
% 0.15/0.38 % (632)------------------------------
% 0.15/0.38 % (632)------------------------------
% 0.15/0.38 % (624)Success in time 0.017 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------